Cheating Prevention in Secret Sharing
نویسندگان
چکیده
The commonly used technique for cheating detection requires that extra information be given to each participant. However, in a secret sharing scheme when the size of shares increases the security of the system degrades. In this paper we study the cheating problem in Shamir's scheme (in the sense of Tompa and Woll 1] attack) and present alternative solutions to this problem. First we consider cheating prevention via longer shares. Next we introduce redundant secret sharing schemes and show how they can be used for cheating prevention. Nonlin-ear secret sharing ooers also some protection against cheaters. The work concludes with a discussion about a combined approach.
منابع مشابه
Cheating Prevention in Linear Secret Sharing
Cheating detection in linear secret sharing is considered. The model of cheating extends the Tompa-Woll attack and includes cheating during multiple (unsuccessful) recovery of the secret. It is shown that shares in most linear schemes can be split into subshares. Subshares can be used by participants to trade perfectness of the scheme with cheating prevention. Evaluation of cheating prevention ...
متن کاملOn the Security of a Cheating Immune Visual Secret Sharing Scheme
Visual Secret Sharing (VSS), first invented by Naor and Shamir, is a variant of secret sharing. In the literature, VSS schemes have many applications, including visual authentication and identification, steganography, and image encryption. Moreover, VSS schemes provide the secure services in communications. In 2010, De Prisco and De Santis deeply discussed the problem of cheating in VSS, gave t...
متن کاملCheating Prevention in Secret Sharing Schemes
We present two new algorithms for making secret sharing cheating immune. The first algorithm modifies Shamir’s scheme to make it k−2 cheating immune and requires no additional storage. The second proposed algorithm provides k−1 cheating immunity under computational assumptions and requires a small constant size additional storage. Here k is the minimum number of players that have to pool their ...
متن کاملSecurity Analysis of a Hash-Based Secret Sharing Scheme
Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...
متن کاملOn Cheating Immune Secret Sharing
The paper addresses the cheating prevention in secret sharing. We consider secret sharing with binary shares. The secret also is binary. This model allows us to use results and constructions from the well developed theory of cryptographically strong boolean functions. In particular, we prove that for given secret sharing, the average cheating probability over all cheating vectors and all origin...
متن کامل